A Nonlinear Programming Approach for a Fuzzy Queue with an Unreliable Server
نویسندگان
چکیده
منابع مشابه
A Nonlinear Programming Approach For a Fuzzy queue with an unreliable server Dr.V
The aim of this paper is to develop the membership functions of the system characteristic of a queuing g model with an unreliable server, in which the arrival rate, service rate, breakdown rate and repair rate are all fuzzy numbers. The -cut approach is used to transform a fuzzy queue with an unreliable server into a family of conventional crisp queues with an unreliable server. By using membe...
متن کاملWorking Vacation Queue with Second Optional Service and Unreliable Server
An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...
متن کاملAnalysis of G – queue with unreliable server
This paper presents a model for a discrete time single server G-queue with two types of independent arrivals, namely positive and negative. The arrival of negative customer to queueing system removes one customer from the head of the queue (RCH), which causes server breakdown. The repair of the server is noninstantaneous and after repair server is assumed as good as new. The interarrival times ...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملAn M/M/1 retrial queue with unreliable server
We analyze an unreliable M/M/1 retrial queue with infinite-capacity orbit and normal queue. Retrial customers do not rejoin the normal queue but repeatedly attempt to access the server at i.i.d. intervals until it is found functioning and idle. We provide stability conditions as well as several stochastic decomposability results. © 2005 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Society for Mathematical Services and Standards
سال: 2012
ISSN: 2277-8020
DOI: 10.18052/www.scipress.com/bsmass.2.44